Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(D, t) -> 1
app2(D, constant) -> 0
app2(D, app2(app2(+, x), y)) -> app2(app2(+, app2(D, x)), app2(D, y))
app2(D, app2(app2(*, x), y)) -> app2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
app2(D, app2(app2(-, x), y)) -> app2(app2(-, app2(D, x)), app2(D, y))
app2(D, app2(minus, x)) -> app2(minus, app2(D, x))
app2(D, app2(app2(div, x), y)) -> app2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
app2(D, app2(ln, x)) -> app2(app2(div, app2(D, x)), x)
app2(D, app2(app2(pow, x), y)) -> app2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(D, t) -> 1
app2(D, constant) -> 0
app2(D, app2(app2(+, x), y)) -> app2(app2(+, app2(D, x)), app2(D, y))
app2(D, app2(app2(*, x), y)) -> app2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
app2(D, app2(app2(-, x), y)) -> app2(app2(-, app2(D, x)), app2(D, y))
app2(D, app2(minus, x)) -> app2(minus, app2(D, x))
app2(D, app2(app2(div, x), y)) -> app2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
app2(D, app2(ln, x)) -> app2(app2(div, app2(D, x)), x)
app2(D, app2(app2(pow, x), y)) -> app2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP2(D, app2(minus, x)) -> APP2(minus, app2(D, x))
APP2(D, app2(app2(-, x), y)) -> APP2(D, y)
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
APP2(D, app2(app2(div, x), y)) -> APP2(app2(*, x), app2(D, y))
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(*, app2(app2(pow, x), y)), app2(ln, x))
APP2(D, app2(app2(+, x), y)) -> APP2(+, app2(D, x))
APP2(D, app2(app2(div, x), y)) -> APP2(pow, y)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(filter2, app2(f, x)), f), x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(D, app2(app2(pow, x), y)) -> APP2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x)))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(filter2, app2(f, x))
APP2(D, app2(app2(pow, x), y)) -> APP2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x)))
APP2(D, app2(app2(*, x), y)) -> APP2(+, app2(app2(*, y), app2(D, x)))
APP2(D, app2(app2(div, x), y)) -> APP2(div, app2(D, x))
APP2(D, app2(ln, x)) -> APP2(app2(div, app2(D, x)), x)
APP2(D, app2(app2(+, x), y)) -> APP2(D, x)
APP2(D, app2(app2(pow, x), y)) -> APP2(D, x)
APP2(D, app2(app2(div, x), y)) -> APP2(app2(pow, y), 2)
APP2(D, app2(app2(*, x), y)) -> APP2(D, y)
APP2(D, app2(app2(pow, x), y)) -> APP2(D, y)
APP2(D, app2(app2(-, x), y)) -> APP2(D, x)
APP2(D, app2(app2(div, x), y)) -> APP2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(D, app2(app2(+, x), y)) -> APP2(app2(+, app2(D, x)), app2(D, y))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(f, x))
APP2(D, app2(app2(*, x), y)) -> APP2(D, x)
APP2(D, app2(app2(div, x), y)) -> APP2(app2(div, app2(D, x)), y)
APP2(D, app2(app2(pow, x), y)) -> APP2(ln, x)
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(cons, x), app2(app2(filter, f), xs))
APP2(D, app2(app2(-, x), y)) -> APP2(-, app2(D, x))
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(pow, x), app2(app2(-, y), 1))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(D, app2(app2(div, x), y)) -> APP2(div, app2(app2(*, x), app2(D, y)))
APP2(D, app2(app2(div, x), y)) -> APP2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2))
APP2(D, app2(minus, x)) -> APP2(D, x)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(D, app2(app2(div, x), y)) -> APP2(-, app2(app2(div, app2(D, x)), y))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(filter2, app2(f, x)), f)
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))
APP2(D, app2(app2(div, x), y)) -> APP2(D, y)
APP2(D, app2(ln, x)) -> APP2(div, app2(D, x))
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(filter, f)
APP2(D, app2(app2(-, x), y)) -> APP2(app2(-, app2(D, x)), app2(D, y))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
APP2(D, app2(app2(div, x), y)) -> APP2(*, x)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(filter, f)
APP2(D, app2(ln, x)) -> APP2(D, x)
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y))
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(-, y), 1)
APP2(D, app2(app2(pow, x), y)) -> APP2(*, app2(app2(pow, x), y))
APP2(D, app2(app2(*, x), y)) -> APP2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
APP2(D, app2(app2(*, x), y)) -> APP2(app2(*, y), app2(D, x))
APP2(D, app2(app2(*, x), y)) -> APP2(app2(*, x), app2(D, y))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(cons, x)
APP2(D, app2(app2(pow, x), y)) -> APP2(*, y)
APP2(D, app2(app2(div, x), y)) -> APP2(D, x)
APP2(D, app2(app2(*, x), y)) -> APP2(*, y)
APP2(D, app2(app2(pow, x), y)) -> APP2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1))))
APP2(D, app2(app2(+, x), y)) -> APP2(D, y)
APP2(D, app2(app2(pow, x), y)) -> APP2(-, y)

The TRS R consists of the following rules:

app2(D, t) -> 1
app2(D, constant) -> 0
app2(D, app2(app2(+, x), y)) -> app2(app2(+, app2(D, x)), app2(D, y))
app2(D, app2(app2(*, x), y)) -> app2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
app2(D, app2(app2(-, x), y)) -> app2(app2(-, app2(D, x)), app2(D, y))
app2(D, app2(minus, x)) -> app2(minus, app2(D, x))
app2(D, app2(app2(div, x), y)) -> app2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
app2(D, app2(ln, x)) -> app2(app2(div, app2(D, x)), x)
app2(D, app2(app2(pow, x), y)) -> app2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(D, app2(minus, x)) -> APP2(minus, app2(D, x))
APP2(D, app2(app2(-, x), y)) -> APP2(D, y)
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
APP2(D, app2(app2(div, x), y)) -> APP2(app2(*, x), app2(D, y))
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(*, app2(app2(pow, x), y)), app2(ln, x))
APP2(D, app2(app2(+, x), y)) -> APP2(+, app2(D, x))
APP2(D, app2(app2(div, x), y)) -> APP2(pow, y)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(filter2, app2(f, x)), f), x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(D, app2(app2(pow, x), y)) -> APP2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x)))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(filter2, app2(f, x))
APP2(D, app2(app2(pow, x), y)) -> APP2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x)))
APP2(D, app2(app2(*, x), y)) -> APP2(+, app2(app2(*, y), app2(D, x)))
APP2(D, app2(app2(div, x), y)) -> APP2(div, app2(D, x))
APP2(D, app2(ln, x)) -> APP2(app2(div, app2(D, x)), x)
APP2(D, app2(app2(+, x), y)) -> APP2(D, x)
APP2(D, app2(app2(pow, x), y)) -> APP2(D, x)
APP2(D, app2(app2(div, x), y)) -> APP2(app2(pow, y), 2)
APP2(D, app2(app2(*, x), y)) -> APP2(D, y)
APP2(D, app2(app2(pow, x), y)) -> APP2(D, y)
APP2(D, app2(app2(-, x), y)) -> APP2(D, x)
APP2(D, app2(app2(div, x), y)) -> APP2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(D, app2(app2(+, x), y)) -> APP2(app2(+, app2(D, x)), app2(D, y))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(f, x))
APP2(D, app2(app2(*, x), y)) -> APP2(D, x)
APP2(D, app2(app2(div, x), y)) -> APP2(app2(div, app2(D, x)), y)
APP2(D, app2(app2(pow, x), y)) -> APP2(ln, x)
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(cons, x), app2(app2(filter, f), xs))
APP2(D, app2(app2(-, x), y)) -> APP2(-, app2(D, x))
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(pow, x), app2(app2(-, y), 1))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(D, app2(app2(div, x), y)) -> APP2(div, app2(app2(*, x), app2(D, y)))
APP2(D, app2(app2(div, x), y)) -> APP2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2))
APP2(D, app2(minus, x)) -> APP2(D, x)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(D, app2(app2(div, x), y)) -> APP2(-, app2(app2(div, app2(D, x)), y))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(filter2, app2(f, x)), f)
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))
APP2(D, app2(app2(div, x), y)) -> APP2(D, y)
APP2(D, app2(ln, x)) -> APP2(div, app2(D, x))
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(filter, f)
APP2(D, app2(app2(-, x), y)) -> APP2(app2(-, app2(D, x)), app2(D, y))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
APP2(D, app2(app2(div, x), y)) -> APP2(*, x)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(filter, f)
APP2(D, app2(ln, x)) -> APP2(D, x)
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y))
APP2(D, app2(app2(pow, x), y)) -> APP2(app2(-, y), 1)
APP2(D, app2(app2(pow, x), y)) -> APP2(*, app2(app2(pow, x), y))
APP2(D, app2(app2(*, x), y)) -> APP2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
APP2(D, app2(app2(*, x), y)) -> APP2(app2(*, y), app2(D, x))
APP2(D, app2(app2(*, x), y)) -> APP2(app2(*, x), app2(D, y))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(cons, x)
APP2(D, app2(app2(pow, x), y)) -> APP2(*, y)
APP2(D, app2(app2(div, x), y)) -> APP2(D, x)
APP2(D, app2(app2(*, x), y)) -> APP2(*, y)
APP2(D, app2(app2(pow, x), y)) -> APP2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1))))
APP2(D, app2(app2(+, x), y)) -> APP2(D, y)
APP2(D, app2(app2(pow, x), y)) -> APP2(-, y)

The TRS R consists of the following rules:

app2(D, t) -> 1
app2(D, constant) -> 0
app2(D, app2(app2(+, x), y)) -> app2(app2(+, app2(D, x)), app2(D, y))
app2(D, app2(app2(*, x), y)) -> app2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
app2(D, app2(app2(-, x), y)) -> app2(app2(-, app2(D, x)), app2(D, y))
app2(D, app2(minus, x)) -> app2(minus, app2(D, x))
app2(D, app2(app2(div, x), y)) -> app2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
app2(D, app2(ln, x)) -> app2(app2(div, app2(D, x)), x)
app2(D, app2(app2(pow, x), y)) -> app2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 46 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(D, app2(app2(pow, x), y)) -> APP2(D, y)
APP2(D, app2(ln, x)) -> APP2(D, x)
APP2(D, app2(app2(-, x), y)) -> APP2(D, y)
APP2(D, app2(app2(-, x), y)) -> APP2(D, x)
APP2(D, app2(app2(*, x), y)) -> APP2(D, x)
APP2(D, app2(app2(div, x), y)) -> APP2(D, y)
APP2(D, app2(app2(pow, x), y)) -> APP2(D, x)
APP2(D, app2(app2(div, x), y)) -> APP2(D, x)
APP2(D, app2(app2(+, x), y)) -> APP2(D, x)
APP2(D, app2(app2(+, x), y)) -> APP2(D, y)
APP2(D, app2(minus, x)) -> APP2(D, x)
APP2(D, app2(app2(*, x), y)) -> APP2(D, y)

The TRS R consists of the following rules:

app2(D, t) -> 1
app2(D, constant) -> 0
app2(D, app2(app2(+, x), y)) -> app2(app2(+, app2(D, x)), app2(D, y))
app2(D, app2(app2(*, x), y)) -> app2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
app2(D, app2(app2(-, x), y)) -> app2(app2(-, app2(D, x)), app2(D, y))
app2(D, app2(minus, x)) -> app2(minus, app2(D, x))
app2(D, app2(app2(div, x), y)) -> app2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
app2(D, app2(ln, x)) -> app2(app2(div, app2(D, x)), x)
app2(D, app2(app2(pow, x), y)) -> app2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(D, app2(app2(pow, x), y)) -> APP2(D, y)
APP2(D, app2(app2(-, x), y)) -> APP2(D, y)
APP2(D, app2(app2(-, x), y)) -> APP2(D, x)
APP2(D, app2(app2(*, x), y)) -> APP2(D, x)
APP2(D, app2(app2(div, x), y)) -> APP2(D, y)
APP2(D, app2(app2(pow, x), y)) -> APP2(D, x)
APP2(D, app2(app2(div, x), y)) -> APP2(D, x)
APP2(D, app2(app2(+, x), y)) -> APP2(D, x)
APP2(D, app2(app2(+, x), y)) -> APP2(D, y)
APP2(D, app2(minus, x)) -> APP2(D, x)
APP2(D, app2(app2(*, x), y)) -> APP2(D, y)
The remaining pairs can at least be oriented weakly.

APP2(D, app2(ln, x)) -> APP2(D, x)
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( pow ) = 3


POL( app2(x1, x2) ) = max{0, 2x1 + x2 - 1}


POL( - ) = 3


POL( + ) = 3


POL( ln ) = 2


POL( APP2(x1, x2) ) = max{0, x2 - 3}


POL( div ) = 3


POL( minus ) = 3


POL( D ) = 1


POL( * ) = 3



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(D, app2(ln, x)) -> APP2(D, x)

The TRS R consists of the following rules:

app2(D, t) -> 1
app2(D, constant) -> 0
app2(D, app2(app2(+, x), y)) -> app2(app2(+, app2(D, x)), app2(D, y))
app2(D, app2(app2(*, x), y)) -> app2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
app2(D, app2(app2(-, x), y)) -> app2(app2(-, app2(D, x)), app2(D, y))
app2(D, app2(minus, x)) -> app2(minus, app2(D, x))
app2(D, app2(app2(div, x), y)) -> app2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
app2(D, app2(ln, x)) -> app2(app2(div, app2(D, x)), x)
app2(D, app2(app2(pow, x), y)) -> app2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(D, app2(ln, x)) -> APP2(D, x)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ln ) = 3


POL( APP2(x1, x2) ) = x2


POL( D ) = 1


POL( app2(x1, x2) ) = max{0, x1 + x2 - 2}



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(D, t) -> 1
app2(D, constant) -> 0
app2(D, app2(app2(+, x), y)) -> app2(app2(+, app2(D, x)), app2(D, y))
app2(D, app2(app2(*, x), y)) -> app2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
app2(D, app2(app2(-, x), y)) -> app2(app2(-, app2(D, x)), app2(D, y))
app2(D, app2(minus, x)) -> app2(minus, app2(D, x))
app2(D, app2(app2(div, x), y)) -> app2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
app2(D, app2(ln, x)) -> app2(app2(div, app2(D, x)), x)
app2(D, app2(app2(pow, x), y)) -> app2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)

The TRS R consists of the following rules:

app2(D, t) -> 1
app2(D, constant) -> 0
app2(D, app2(app2(+, x), y)) -> app2(app2(+, app2(D, x)), app2(D, y))
app2(D, app2(app2(*, x), y)) -> app2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
app2(D, app2(app2(-, x), y)) -> app2(app2(-, app2(D, x)), app2(D, y))
app2(D, app2(minus, x)) -> app2(minus, app2(D, x))
app2(D, app2(app2(div, x), y)) -> app2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
app2(D, app2(ln, x)) -> app2(app2(div, app2(D, x)), x)
app2(D, app2(app2(pow, x), y)) -> app2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
The remaining pairs can at least be oriented weakly.

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( filter ) = 2


POL( true ) = 0


POL( false ) = max{0, -3}


POL( map ) = 3


POL( app2(x1, x2) ) = x1 + 2x2 + 1


POL( filter2 ) = 2


POL( APP2(x1, x2) ) = 2x2 + 2


POL( cons ) = max{0, -1}



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)

The TRS R consists of the following rules:

app2(D, t) -> 1
app2(D, constant) -> 0
app2(D, app2(app2(+, x), y)) -> app2(app2(+, app2(D, x)), app2(D, y))
app2(D, app2(app2(*, x), y)) -> app2(app2(+, app2(app2(*, y), app2(D, x))), app2(app2(*, x), app2(D, y)))
app2(D, app2(app2(-, x), y)) -> app2(app2(-, app2(D, x)), app2(D, y))
app2(D, app2(minus, x)) -> app2(minus, app2(D, x))
app2(D, app2(app2(div, x), y)) -> app2(app2(-, app2(app2(div, app2(D, x)), y)), app2(app2(div, app2(app2(*, x), app2(D, y))), app2(app2(pow, y), 2)))
app2(D, app2(ln, x)) -> app2(app2(div, app2(D, x)), x)
app2(D, app2(app2(pow, x), y)) -> app2(app2(+, app2(app2(*, app2(app2(*, y), app2(app2(pow, x), app2(app2(-, y), 1)))), app2(D, x))), app2(app2(*, app2(app2(*, app2(app2(pow, x), y)), app2(ln, x))), app2(D, y)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 2 less nodes.